Von Neumann, Turing a Gödel: o mysli a strojích

نویسندگان

چکیده

The paper discusses some of the poorly explored links between conceptual systems logic in Kurt Gödel, theory automata Alan Turing, and self-reproducing John von Neumann. Traditional controversies are left aside (especially opposition Gödel Turing view mind) attention is focused on similarities all three authors. In individual chapters, text deals with: form differentiation syntax semantics formal system Neumann; Neumann’s variant Gödel’s theorem conception machine; finally same basis relation mind automaton

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proof Pearl: Proving a Simple Von Neumann Machine Turing Complete

In this paper we sketch an ACL2-checked proof that a simple but unbounded Von Neumann machine model is Turing Complete, i.e., can do anything a Turing machine can do. The project formally revisits the roots of computer science. It requires re-familiarizing oneself with the definitive model of computation from the 1930s, dealing with a simple “modern” machine model, thinking carefully about the ...

متن کامل

From Turing and von Neumann to the Present

The notion of automata in the sense of machines that operate on their own from encoded instructions is very ancient, and one might say that mechanical clocks and music boxes fall under this category. The idea of computing machines is also very old. For instance. Pascal and Leibnitz outlined various schematics for such machines. In the latter part of the 18th century Baron de Kempelen built what...

متن کامل

Gödel on Turing on Computability

In section 9 of his paper, “On Computable Numbers,” Alan Turing outlined an argument for his version of what is now known as the Church–Turing thesis: “the [Turing machine] ‘computable’ numbers include all numbers which would naturally be regarded as computable” [p. 135]. The argument, which relies on an analysis of calculation by an (ideal) human, has attracted much attention in recent years. ...

متن کامل

Von Neumann revisited: A turing machine with self-repair and self-reproduction properties

The growth and the operation of all living beings are directed through the interpretation, in each of their cells, of a chemical program, the DNA. This program, called genome, is the blueprint of the organism and consists of a sequence of tour discrete characters: A, C, G, and T. This process is the source of inspiration for the Embryonics (embryological electronics) project, whose final object...

متن کامل

von Neumann Universe : A Perspective

To commemorate the 49th anniversery of his death, falling on 25th July, John von Neumann(1903 − 1957), popularly called Johnny, may be complimented by remembering him as the last complete mathematician after Carl Friedrich Gauss (1777 − 1855). Based on various sources, von Neumann’s work can be seen to include: mathematical logic; pure mathematics; quantum physics; computing (his invention); cy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Teorie ve?dy

سال: 2023

ISSN: ['1804-6347', '1210-0250']

DOI: https://doi.org/10.46938/tv.2022.556